Some bounds for the Ramsey-Paris-Harrington numbers
نویسندگان
چکیده
منابع مشابه
Some Bounds for the Ramsey-Paris-Harrington Numbers
It has recently been discovered that a certain variant of Ramsey's theorem cannot be proved in first-order Peano arithmetic although it is in fact a true theorem. In this paper we give some bounds for the "Ramsey-Paris-Harrington numbers" associated with this variant of Ramsey's theorem, involving coloring of pairs . In the course of the investigation we also study certain weaker and stronger p...
متن کاملBounds on Some Ramsey Numbers
For graphs G1, G2, · · · , Gm, the Ramsey number R(G1, G2, · · · , Gm) is defined to be the smallest integer n such that anym-coloring of the edges of the complete graphKn must include a monochromatic Gi in color i, for some i. In this note we establish several lower and upper bounds for some Ramsey numbers involving quadrilateral C4, including R(C4,K9) ≤ 32, 19 ≤ R(C4, C4,K4) ≤ 22, 31 ≤ R(C4, ...
متن کاملUpper Bounds for Positional Paris-Harrington Games
We give upper bounds for a positional game — in the sense of Beck — based on the Paris-Harrington principle for bi-colorings of graphs and uniform hypergraphs of arbitrary dimension. The bounds show a striking difference with respect to the bounds of the combinatorial principle itself. Our results confirm a phenomenon already observed by Beck and others: the upper bounds for the game version of...
متن کاملSharp Phase Transition Thresholds for the Paris Harrington Ramsey Numbers for a Fixed Dimension
This article is concerned with investigations on a phase transition which is related to the (finite) Ramsey theorem and the Paris-Harrington theorem. For a given number-theoretic function g, let Rd c (g)(k) be the least natural number R such that for all colourings P of the d-element subsets of {0, . . . , R− 1} with at most c colours there exists a subset H of {0, . . . , R− 1} such that P has...
متن کاملSome constructive bounds on Ramsey numbers
Article history: Received 4 April 2009 Available online 2 February 2010
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1981
ISSN: 0097-3165
DOI: 10.1016/0097-3165(81)90040-6